Optimality conditions and constraint qualifications for cardinality constrained optimization problems

نویسندگان

چکیده

The cardinality constrained optimization problem (CCOP) is an where the maximum number of nonzero components any feasible point bounded. In this paper, by rewriting constraint as a requiring that must lie in union certain subspaces, we consider CCOP mathematical program with disjunctive subspaces constraints (MPDSC). Since subspace special case convex polyhedral set, MPDSC (MPDC). Using structure are able to obtain more precise formulas for tangent and (directional) normal cones set subspaces. We then first second order optimality conditions using corresponding results from MPDC. Thanks subspace, some do not hold general particular show relaxed constant positive linear dependence (RCPLD) sufficient condition metric subregularity/error bound property which true MPDC general. Finally under all qualifications presented exact penalization holds CCOP.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization

Sequential optimality conditions for constrained optimization are necessarily satisfied by local minimizers, independently of the fulfillment of constraint qualifications. These conditions support the employment of different stopping criteria for practical optimization algorithms. On the other hand, when an appropriate strict constraint qualification associated with some sequential optimality c...

متن کامل

Constraint qualifications and optimality conditions for optimization problems with cardinality constraints

This paper considers optimization problems with cardinality constraints. Based on a recently introduced reformulation of this problem as a nonlinear program with continuous variables, we first define some problem-tailored constraint qualifications and then show how these constraint qualifications can be used to obtain suitable optimality conditions for cardinality constrained problems. Here, th...

متن کامل

Necessary optimality conditions for constrained optimization problems under relaxed constraint qualifications

We derive firstand second-order necessary optimality conditions for set-constrained optimization problems under the constraint qualificationtype conditions significantly weaker than Robinson’s constraint qualification. Our development relies on the so-called 2-regularity concept, and unifies and extends the previous studies based on this concept. Specifically, in our setting constraints are giv...

متن کامل

Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints

A very general optimization problem with a variational inequality constraint, inequality constraints, and an abstract constraint are studied. Fritz John type and Kuhn–Tucker type necessary optimality conditions involving Mordukhovich coderivatives are derived. Several constraint qualifications for the Kuhn–Tucker type necessary optimality conditions involving Mordukhovich coderivatives are intr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Numerical Algebra, Control and Optimization

سال: 2023

ISSN: ['2155-3297', '2155-3289']

DOI: https://doi.org/10.3934/naco.2023011